A dynamic generating graphical model for point-sets matching

نویسندگان

  • Xuan Zhao
  • Shengjin Wang
  • Xiaoqing Ding
چکیده

This paper presents a new dynamic generating graphical model for point-sets matching. The existing algorithms on graphical models proved to be quite robust to noise but are susceptible to the effect of outliers. We discuss the separator’s influences on point-sets matching in inference on graphical models theoretically and find that the separator which consists of outliers will break the message-passing, which will directly lead to the breaking down of the existing methods. Due to the conclusion above, in order to minimize the outliers in separator we propose a new algorithm in generating a graphical model and the corresponding Junction Tree for point-sets matching. The experimental results show that the proposed algorithm is significantly more stable and possesses higher accuracy on point-sets matching, which can overcome the limitation of sensitivity on outliers in the existing graphical models.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fully Integrated Approach for Better Determination of Fracture Parameters Using Streamline Simulation; A gas condensate reservoir case study in Iran

      Many large oil and gas fields in the most productive world regions happen to be fractured. The exploration and development of these reservoirs is a true challenge for many operators. These difficulties are due to uncertainties in geological fracture properties such as aperture, length, connectivity and intensity distribution. To successfully address these challenges, it is paramount to im...

متن کامل

Fast matching of large point sets under occlusions

The problem of isometric point-pattern matching can be modeled as inference in small tree-width graphical models whose embeddings in the plane are said to be ‘globally rigid’. Although such graphical models lead to efficient and exact solutions, they cannot generally handle occlusions, as even a single missing point may ‘break’ the rigidity of the graph in question. In addition, such models can...

متن کامل

An Approach for Accurate Edging using Dynamic Membership Functions

In this paper, by means of fuzzy approaches, an accurate method is introduced for edging of color photographs. The difference between our method with other similar methods is the use of a morphological operation to think or thick the obtained edges. In this proposed method, a 3×3 window is dragged on the photo. For each block, 12 point sets will be defined, each including two non-overlapping po...

متن کامل

Fractured Reservoirs History Matching based on Proxy Model and Intelligent Optimization Algorithms

   In this paper, a new robust approach based on Least Square Support Vector Machine (LSSVM) as a proxy model is used for an automatic fractured reservoir history matching. The proxy model is made to model the history match objective function (mismatch values) based on the history data of the field. This model is then used to minimize the objective function through Particle Swarm Optimization (...

متن کامل

Graphical models for graph matching: Approximate models and optimal algorithms

Comparing scene, pattern or object models to structures in images or determining the correspondence between two point sets are examples of attributed graph matching. In this paper we show how such problems can be posed as one of inference over hidden Markov random fields. We review some well known inference methods studied over past decades and show how the Junction Tree framework from Graphica...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 185  شماره 

صفحات  -

تاریخ انتشار 2007